On permutation complexity of fixed points of some uniform binary morphisms
نویسنده
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. On permutation complexity of fixed points of some uniform binary morphisms Alexandr Valyuzhenich
منابع مشابه
Permutation complexity of the fixed points of some uniform binary morphisms
The notion of an infinite permutation was introduced in [1], where were investigated the periodic properties and low complexity of permutations. Similarly to the definition of subword complexity of infinite words, we can introduce the notion of the factor complexity of a permutation as the number of distinct subpermutations of a given length. The notion of a permutation generated by an infinite...
متن کاملOn the Asymptotic Abelian Complexity of Morphic Words
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...
متن کاملPermutation complexity of images of Sturmian words by marked morphisms
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is n+ k for some constant k and all lengths n sufficiently large.
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملFixed points for E-asymptotic contractions and Boyd-Wong type E-contractions in uniform spaces
In this paper we discuss on the fixed points of asymptotic contractions and Boyd-Wong type contractions in uniform spaces equipped with an E-distance. A new version ofKirk's fixed point theorem is given for asymptotic contractions and Boyd-Wong type contractions is investigated in uniform spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017